/**
 * Created with IntelliJ IDEA.
 * Description:第 N个泰波那契数
 * User: YJ
 * Date: 2023-9-20
 * Time: 20:43
 */
public class Tebonacci {

    public static int tebonacci(int n) {
        // 1.创建dp表
        // 2.初始化
        // 3.填表
        // 4.返回值
        // 处理边界情况
        if(n==0) return 0;
        if(n == 1 || n == 2) return 1;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(tebonacci(25));
    }
}
